Fractal squares with finitely many connected components <sup>*</sup>
نویسندگان
چکیده
In this paper, we present an effective method to characterize completely when a disconnected fractal square has only finitely many connected components. Our is establish some graph structures on squares reveal the evolution of connectedness during their geometric iterated construction. We also prove that every contains either or uncountably A few examples, including construction with exactly $m\geqslant 2$ components, are added in addition.
منابع مشابه
On solubility of groups with finitely many centralizers
For any group G, let C(G) denote the set of centralizers of G.We say that a group G has n centralizers (G is a Cn-group) if |C(G)| = n.In this note, we prove that every finite Cn-group with n ≤ 21 is soluble andthis estimate is sharp. Moreover, we prove that every finite Cn-group with|G| < 30n+1519 is non-nilpotent soluble. This result gives a partial answer to aconjecture raised by A. Ashrafi in ...
متن کاملModel theoretic connected components of finitely generated nilpotent groups
We prove that for a finitely generated infinite nilpotent group G with a first order structure (G, ·, . . .), the connected component G of a sufficiently saturated extension G of G exists and equals ⋂ n∈N {g : g ∈ G}. We construct a first order expansion of Z by a predicate (Z,+, P ) such that the type-connected component Z ∅ is strictly smaller than Z. We generalize this to finitely generated ...
متن کاملEquisingular Families of Plane Curves with Many Connected Components
We present examples of equisingular families of complex projective plane curves with plural connected components that are not distinguished by the fundamental group of the complement.
متن کاملProvability with finitely many variables
For every finite n ≥ 4 there is a logically valid sentence φn with the following properties: φn contains only 3 variables (each of which occurs many times); φn contains exactly one nonlogical binary relation symbol (no function symbols, no constants, and no equality symbol); φn has a proof in first-order logic with equality that contains exactly n variables, but no proof containing only n − 1 v...
متن کاملon solubility of groups with finitely many centralizers
for any group g, let c(g) denote the set of centralizers of g.we say that a group g has n centralizers (g is a cn-group) if |c(g)| = n.in this note, we prove that every finite cn-group with n ≤ 21 is soluble andthis estimate is sharp. moreover, we prove that every finite cn-group with|g| < 30n+1519 is non-nilpotent soluble. this result gives a partial answer to aconjecture raised by a. ashrafi in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinearity
سال: 2021
ISSN: ['0951-7715', '1361-6544']
DOI: https://doi.org/10.1088/1361-6544/abd611